Separating Weakening and Contraction in a Linear Lambda Calculus

نویسنده

  • John Maraist
چکیده

We present a separated-linear lambda calculus of resource consumption based on a refinement of linear logic which allows separate control of weakening and contraction. The calculus satisfies subject reduction and confluence, and inherits previous results on the relationship of Girard’s two translations from minimal intuitionistic logic to linear logic with call-by-name and call-by-value. We construct a hybrid translation from Girard’s two which is sound and complete for mapping types and reduction sequences from call-by-need into separatedlinear . This treatment of call-by-need is more satisfying than in previous work, allowing a contrasting of all three reduction strategies in the manner (for example) that the CPS translations allow for call-by-name and call-by-value. HOW can we explain the differences between parameter-passing styles? With the continuation-passing style (CPS) transforms [24, 25], one makes the flow of control explicit. Each parameter-passing style is associated with a different CPS transform, which reveals the control-flow decisions implicit in each mechanism. In fact these implicit control decisions explain the difference between the mechanisms quite well, and evaluation of the transformed terms actually becomes independent of any particular parameter-passing mechanism. In this paper, we will also compare different calling mechanisms by mapping them into a common system, but rather than focusing on the flow of control as with the CPS transforms, we will contrast the mechanisms in terms of structural typing operations, which reveal how programs use resources, namely their parameters. In particular, we will use linear systems, which allow structural operations only in conjunction with a new modal connective. Moreover, rather than considering linear systems with a single intuitionistic mode, as in previous linear calculi, we will construct as a target of the translations a separated-linear lambda calculus motivated by Jacobs’ model theory [17], where the two key structural operations of weakening and contraction are enabled by distinct modal connectives, rather than the same single connective. This presentation assumes familiarity with the lambda calculus and its simple types [5], intuitionistic logic [27] and the basics of linear logic [13].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-paradigm Logic Programming Finer Control of Weakening and Contraction: towards a Separated-linear Lambda Calculus (summary)

P lotkin demonstrated how two diierent parameter-passing mechanisms could be explained by two diierent translations from the-calculus into the calculus of the continuation passing style 12]. Each of his transformations makes the control operations of each particular mechanism explicit in the transformed term, so that reduction of the transformed term by either mechanism produces equivalent resu...

متن کامل

Finer Control of Weakening and Contraction : Towards aSeparated - Linear

P lotkin demonstrated how two diierent parameter-passing mechanisms could be explained by two diierent translations from the-calculus into the calculus of the continuation passing style 12]. Each of his transformations makes the control operations of each particular mechanism explicit in the transformed term, so that reduction of the transformed term by either mechanism produces equivalent resu...

متن کامل

The Linear Lambda Calculus

Girard described two translations of intuitionistic logic into linear logic, one where A ! B maps to (!A) ? B, and another where it maps to !(A ? B). We detail the action of these translations on terms, and show that the rst corresponds to a call-by-name calculus, while the second corresponds to call-by-value. We further show that if the target of the translation is taken to be an aane calculus...

متن کامل

Call - by - need splits the mode !

We present a separated-linear lambda calculus based on a reenement of linear logic which allows separate control of weakening and contraction. The calculus satisses subject reduction and connuence, has a straightforward notion of standard evaluation, and inherits previous results on the relationship of Girard's two translations from minimal intuitionistic logic to linear logic with call-by-name...

متن کامل

Lambda Calculus and Intuitionistic Linear Logic

The Curry-Howard isomorphism 1 is the basis of typed functional programming. By means of this isomorphism, the intuitionistic proof of a formula can be seen as a functional program, whose type is the formula itself. In this way, the computation process has its logic realization in the proof normalization procedure. Both the implicative fragment of the intuitionistic propositional logic together...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998